Minimum Eccentricity Shortest Path Problem with Respect to Structural Parameters
نویسندگان
چکیده
The Minimum Eccentricity Shortest Path Problem consists in finding a shortest path with minimum eccentricity given undirected graph. problem is known to be NP-complete and W[2]-hard respect the desired eccentricity. We present fpt-algorithms for parameterized by modular width, distance cluster graph, combination of treewidth eccentricity, maximum leaf number.
منابع مشابه
On the Minimum Eccentricity Shortest Path Problem
Find a shortest path P with minimum eccentricity, Find a shortest path P with minimum eccentricity,
متن کاملMinimum Eccentricity Shortest Path Problem: An Approximation Algorithm and Relation with the k-Laminarity Problem
The Minimum Eccentricity Shortest Path (MESP) Problem consists in determining a shortest path (a path whose length is the distance between its extremities) of minimum eccentricity in a graph. It was introduced by Dragan and Leitert [9] who described a linear-time algorithm which is an 8-approximation of the problem. In this paper, we study deeper the double-BFS procedure used in that algorithm ...
متن کاملShortest Path Problem with Gamma Probability Distribution Arc Length
We propose a dynamic program to find the shortest path in a network having gamma probability distributions as arc lengths. Two operators of sum and comparison need to be adapted for the proposed dynamic program. Convolution approach is used to sum two gamma probability distributions being employed in the dynamic program.
متن کاملThe shortest path problem on networks with fuzzy parameters
Shortest path problem where the costs have vague values is one of the most studied problems in fuzzy sets and systems area. However, due to its high computational complexity, previously published algorithms present peculiarities and problems that need to be addressed (e.g. they find costs without an existing path, they determine a fuzzy solution set but do not give any guidelines to help the de...
متن کاملEfficient algorithms for the minimum shortest path Steiner arborescence problem with applications to VLSI physical design
Given an undirected graph G = (V; E) with positive edge weights (lengths) w: E ! <, a set of terminals (sinks) N V , and a unique root node r 2 N , a shortest path Steiner arborescence (hereafter an arborescence) is a Steiner tree rooted at r spanning all terminals in N such that every source-tosink path is a shortest path in G. Given a triple (G; N; r), the minimum shortest path Steiner arbore...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2022
ISSN: ['1432-0541', '0178-4617']
DOI: https://doi.org/10.1007/s00453-022-01006-x